Communication-Efficient Edge AI: Algorithms and Systems
نویسندگان
چکیده
منابع مشابه
Efficient Detection Algorithms for MIMO Communication Systems
In this paper, two new efficient detection algorithms, Type 1 (T1) with better complexity-performance tradeoff and Type 2 (T2) with lower complexity, are derived from one generalized framework for multiple-input multipleoutput (MIMO) communication systems. The proposed generalized detection framework constructed by parallel interference cancellation (PIC), group, and iteration techniques provid...
متن کاملComputationally efficient optimal power allocation algorithms for multicarrier communication systems
In this paper, we present an optimal, computationally efficient, integer-bit power allocation algorithm for discrete multitone modulation. Using efficient lookup table searches and a Lagrange-multiplier bisection search, our algorithm converges faster to the optimal solution than existing techniques and can replace the use of suboptimal methods because of its low computational complexity. Fast ...
متن کاملEfficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
We present new edge splitting-off results maintaining all-pairs edge-connectivities of an undirected graph. We first give an alternate proof of Mader’s theorem, and use it to obtain a deterministic Õ(m + rmax · n2)-time complete edge splitting-off algorithm for unweighted graphs, where rmax denotes the maximum edge-connectivity requirement. This improves upon the best known algorithm by Gabow b...
متن کاملCommunication-Efficient Algorithms For Distributed Optimization
This thesis is concerned with the design of distributed algorithms for solving optimization problems. The particular scenario we consider is a network with P compute nodes, where each node p has exclusive access to a cost function fp. We design algorithms in which all the nodes cooperate to find the minimum of the sum of all the cost functions, f1 + · · · + fP . Several problems in signal proce...
متن کاملEfficient fair algorithms for message communication
A computer network serves distributed applications by communicating messages between their remote ends. Many such applications desire minimal delay for their messages. Beside this efficiency objective, allocation of the network capacity is also subject to the fairness constraint of not shutting off communication for any individual message. Processor Sharing (PS) is a de facto standard of fairne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Surveys & Tutorials
سال: 2020
ISSN: 1553-877X,2373-745X
DOI: 10.1109/comst.2020.3007787